A New Method for Finding an Optimal Solution

نویسندگان

  • D. Anuradha
  • P. Pandian
چکیده

A new method namely, reduction method is proposed for finding an optimal solution of solid assignment problems. The proposed method does not based on the Hungarian method. With help of a numerical example, the reduction method is illustrated. The solution obtained by the proposed method will help the decision makers to take an appropriate action when they are handling various types of three dimensional assignment problems. Mathematics Subject Classifications: 90C08, 90C90

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Approach for Finding an Optimal Solution for Grey Transportation Problem

In ordinary transportation problems, it is always supposed that the mileage from every source to every destination is a definite number. But in special conditions, such as transporting emergency materials when natural calamity occurs or transporting military supplies during wartime, carrying network may be destroyed, mileage from some sources to some destinations are no longer definite. It is u...

متن کامل

Neuro-Optimizer: A New Artificial Intelligent Optimization Tool and Its Application for Robot Optimal Controller Design

The main objective of this paper is to introduce a new intelligent optimization technique that uses a predictioncorrectionstrategy supported by a recurrent neural network for finding a near optimal solution of a givenobjective function. Recently there have been attempts for using artificial neural networks (ANNs) in optimizationproblems and some types of ANNs such as Hopfield network and Boltzm...

متن کامل

A new method for solving fully fuzzy linear Bilevel programming problems

In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...

متن کامل

Finding the Optimal Place of Sensors for a 3-D Damped Wave Equation by using Measure Approach

In this paper‎, ‎we model and solve the problem of optimal shaping and placing to put sensors for a 3-D wave equation with constant damping in a bounded open connected subset‎ ‎of 3-dimensional space‎. ‎The place of sensor is modeled by a subdomain‎ ‎of this region of a given measure‎. ‎By using an approach based on the embedding process‎, ‎first‎, ‎the system is formulated in variational form;...

متن کامل

A full ranking method using integrated DEA models and its application to modify GA for finding Pareto optimal solution of MOP problem

This paper uses integrated Data Envelopment Analysis (DEA) models to rank all extreme and non-extreme efficient Decision Making Units (DMUs) and then applies integrated DEA ranking method as a criterion to modify Genetic Algorithm (GA) for finding Pareto optimal solutions of a Multi Objective Programming (MOP) problem. The researchers have used ranking method as a shortcut way to modify GA to d...

متن کامل

A New Solution for the Cyclic Multiple-Part Type Three-Machine Robotic Cell Problem based on the Particle Swarm Meta-heuristic

In this paper, we develop a new mathematical model for a cyclic multiple-part type threemachine robotic cell problem. In this robotic cell a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calcul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012